Beyond Knights and Knaves

نویسندگان

  • Christine T. Cheng
  • Andrew McConvey
  • Drew Onderko
  • Nathaniel Shar
  • Charles Tomlinson
چکیده

In the classic knights and knaves problem, there are n people in a room each of whom is a knight or a knave. Knights always tell the truth while knaves always lie. Everyone in the room knows each other’s identity. You are allowed to ask questions of the form “Person i, is person j a knight?” and you are told that there are more knights than knaves. What is the fewest number of questions you can ask to determine a knight? How about to determine everyone’s identity? In this paper, we consider the knights and no-men problem, where a noman is a person who always answers “no”. Assuming there are at least k knights, we show that ( n−1 2 ) −⌊ (k−2)(n−1) 2 2(k−1) ⌋ questions are necessary and sufficient in the worst case to identify a knight. We also show that n− 2 questions suffice to identify a no-man, and ( n−1 2 ) −⌊ (k−2)(n−1) 2 2(k−1) ⌋+n− 2 questions suffice to identify everyone in the room. We then consider a generalization of the knights and knaves problem that captures most of the variants of the knights and knaves problem in the literature. In the agent labeling problem, we wish to identify everyone’s type; in the agent identification problem, we wish to identify an agent having a particular type. We present results with regards to the fewest number of questions needed in the worst case to solve both the agent labeling and agent identification problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Logic of Knights, Knaves, Normals and Mutes

R. M. Smullyan wrote in his book about islands, knights and knaves. The knights always tell the truth and the knaves are always lying. Instead of say we shall examine the can say modal operator. We show the soundness and the completeness of this logic.

متن کامل

Proving Facts about "|"

We study the Knights and Knaves problem, and find that for a proper treatment via theorem-proving, an interaction with natural language processing research is helpful. In particular, we discuss Ohlbach's claim that first-order logic is not well suited to handling this problem. Then we provide another interpretation of the problem using indexicals, and axiomatize it so that the desired result fo...

متن کامل

Emergent bipartiteness in a society of knights and knaves

We propose a simple model of a social network based on so-called knights-and-knaves puzzles. The model describes the formation of networks between two classes of agents where links are formed by agents introducing their neighbors to others of their own class. We show that if the proportion of knights and knaves is within a certain range, the network self-organizes to a perfectly bipartite state...

متن کامل

Logicians Who Reason About Themselves

By treating belief as a modality and combining this with problems about constant truth tel lers and constant l iars (knights and knaves) we obtain some curious epistemic counterparts of undecidability results in metamathematics. Godel's second theorem gets reflected in a logician who cannot believe in his own consistency without becoming inconsistent. Lob's theorem reflects i t se l f in a vari...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013